C-Planarity of C-Connected Clustered Graphs Part II – Testing and Embedding Algorithm
نویسنده
چکیده
We present a linear time c-planarity testing and embedding algorithm for c-connected clustered graphs. The algorithm is based on a characterization of the clustered planarity given in a companion paper [3]. The algorithm is reasonably easy to implement, since it exploits as building blocks simple algorithmic tools like the computation of lowest common ancestors, of minimum and maximum spanning trees, and of bucket sorts. It also makes use of data structures like the SPQR-trees and the BC-trees. If the test fails it gives a structural certificate of the intrinsic reasons causing the non c-planarity.
منابع مشابه
C-Planarity of C-Connected Clustered Graphs Part I – Characterization
We present a characterization of the c-planarity of c-connected clustered graphs. The characterization is based on the interplay between the hierarchy of the clusters and the hierarchy of the triconnected and biconnected components of the graph underlying the clustered graph. In a companion paper [2] we exploit such a characterization to give a linear time c-planarity testing and embedding algo...
متن کاملPlanarity Testing for C-Connected Clustered Graphs
We present a linear time algorithm for testing clustered planarity of c-connected clustered graphs and for computing a clustered planar embedding for such graphs. Our algorithm uses a decomposition of the input graph based on SPQR-trees and is the first linear time algorithm for clustered planarity testing. We define a normal form of clustered embeddings and show that a clustered graph is clust...
متن کاملClustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every cluster induces a subgraph with at most two connected components.
متن کاملSplitting Clusters to Get C-Planarity
In this paper we introduce a generalization of the c-planarity testing problem for clustered graphs. Namely, given a clustered graph, the goal of the SPLIT-C-PLANARITY problem is to split as few clusters as possible in order to make the graph c-planar. Determining whether zero splits are enough coincides with testing c-planarity. We show that SPLIT-C-PLANARITY is NP-complete for c-connected clu...
متن کاملC-Planarity of C-Connected Clustered Graphs
We present the first characterization of c-planarity for c-connected clustered graphs. The characterization is based on the interplay between the hierarchy of the clusters and the hierarchies of the triconnected and biconnected components of the underlying graph. Based on such a characterization, we provide a linear-time c-planarity testing and embedding algorithm for c-connected clustered grap...
متن کامل